Mega Code Archive
Collections Data Structure
1) A bag of weakly referenced objects
2) A basic priority linked list
3) A binary search implementation
4) A boolean is being stored and then retrieved from an ArrayList
5) A circular queue from mina
6) A class for you to extend when you want object to maintain a doubly linked list
7) A Class Implementing Comparable
8) A class that wraps an array with a List interface
9) A class to iterate over all permutations of an array
10) A combination of two collections into a collection
11) A CompactHashSet implements the set interface more tightly in memory and more efficiently than Javas java util
12) A Comparator for Boolean objects that can sort either true or false first
13) A daemon thread that continuously dequeues Runnable instances from a queue and executes them
14) A directed graph data structure
15) A faster, smaller stack implementation
16) A fixed size map implementation
17) A GOF Adapter to make instances of old Enumeration interface behave like new Iterator interface
18) A growable array of bytes
19) A growable array of int values, suitable for use with multiple threads
20) A hash map that uses primitive ints for the key rather than objects
21) A hash table with emweak keysem, full concurrency of retrievals, and adjustable expected concurrency for update
22) A hashtable-based Map implementation with soft keys
23) A hashtable-based Map implementation with weak keys and using reference-equality in place of object-equality wh
24) A heap-based priority queue, without any concurrency control
25) A java util Map implementation using reference values
26) A java util Map implementation with soft values
27) A java util Map interface which can only hold a single object
28) A List helper class that attempts to avoid unneccessary List creation
29) A List that, like a Set, contains no duplicate Elements
30) A map acts like array
31) A Map collection with real-time behavior
32) A map declared to hold objects of a type T can also hold objects that extend from T
33) A Map implementation that dumps its content when memory runs low
34) A Map implementation that grows to a fixed size and then retains only a fixed number of the highest (largest) k
35) A Map implemented with ArrayLists
36) A map of values by class
37) A Map that accepts int or Integer keys only
38) A Map that stores the values in files within a directory
39) A Map where keys are compared by object identity, rather than equals()
40) A Map with multiple values for a key
41) A memory-efficient hash map
42) A memory-efficient hash set
43) A MinMaxHeap provides a heap-like data structure that provides fast access to both the minimum and maximum elem
44) A more robust enumeration system
45) A multi valued Map
46) A NumberedSet is a generic container of Objects where each element is identified by an integer id
47) A numeric range has a high, low, mean, root-mean-square, standard deviation, and the count of how many samples
48) A numerical interval
49) A phantom reference is used to determine when an object is just about to be reclaimed
50) A programmable Finite State Machine implementation
51) A quick sort algorithm to sort Vectors or arrays Provides sort and binary search capabilities
52) A quick sort demonstration algorithm
53) A range of integers
54) A set acts like array
55) A simple applet class to demonstrate a sort algorithm
56) A simple class that stores key Strings as char[]s in a hash table
57) A simple Doubly Linked list class, designed to avoid O(n) behaviour on insert and delete
58) A simple hashmap from keys to integers
59) A simple integer based stack
60) A simple Map implementation
61) A singleton null object Iterator implementation
62) A soft reference holds onto its referent until memory becomes low
63) A sorted set is a set that maintains its items in a sorted order
64) A SortedMap implementation for dealing with fuzzy keys A binary search is used to find the closest key to the i
65) A space-optimized map for associating char keys with values
66) A thin wrapper around a List transforming it into a modifiable Set
67) A thread-safe Set that manages canonical objects
68) A tree structure that maps inheritance hierarchies of classes
69) A TreeSet that ensures it never grows beyond a max size
70) A two dimensional Vector
71) A utility class for working with attribute and parameter collections used by Spring Web FLow
72) A value retrieved from a type-specific collection does not need to be casted
73) A variable length Double Array
74) A variant of java util ArrayList in which all mutative operations (add, set, and so on) are implemented by maki
75) A version of Hashtable supporting concurrency for both retrievals and updates
76) A version of Hashtable that supports mostly-concurrent reading, but exclusive writing
77) A very simple unsynchronized stack This one is faster than the java util-Version
78) A weak HashSet
79) A weak reference is used to determine when an object is no longer being referenced
80) A WeakValueHashMap is implemented as a HashMap that maps keys to Weak Values
81) Acts like an java util ArrayList but for primitive int values
82) Acts like an java util ArrayList but for primitive long values
83) Adapt iterator to iterable
84) Adaptive extension of the java util Vector class
85) Add an element to specified index of Java ArrayList
86) Add array to collection
87) Add elements at beginning and end of LinkedList Java example
88) Add new value to exsisting array The new value is indexed to the last
89) Add new value, which sets as the first value, to existing array
90) Add one array to another
91) Add or insert an element to ArrayList using Java ListIterator Example
92) Add to end Performance compare
93) Add to start Performance compare
94) Add values to HashSetString
95) Add values to TreeSetString
96) Adds all the elements of the given arrays into a new array
97) Adds all the elements of the given arrays into a new boolean-value array
98) Adds all the elements of the given arrays into a new byte-type array
99) Adds all the elements of the given arrays into a new char-type array
100) Adds all the elements of the given arrays into a new double-type array
101) Adds all the elements of the given arrays into a new float-type array
102) Adds all the elements of the given arrays into a new int-type array
103) Adds all the elements of the given arrays into a new long-type array
104) Adds all the elements of the given arrays into a new short-type array
105) Adds the object to the array
106) Allows threads to communicate asynchronously by putting messages into and reading messages out of a synchronize
107) An array iterator
108) An ArrayMap is a very inefficient map type that is more robust in dealing with changes to its keys than other m
109) An enumeration that iterates over an array
110) An extendable Graph datastructure
111) An IdentityMap that uses reference-equality instead of object-equality
112) An IdentitySet that uses reference-equality instead of object-equality
113) An Iterator that returns the elements of a specified array, or other iterators etc
114) An Iterator that wraps a number of Iterators
115) An Iterator to iterate over the elements of an array
116) An Iterator wrapper for an Enumeration
117) An Iterator wrapper for an Object[], allow us to deal with all array like structures in a consistent manner
118) An implementation of Set that manages a map of soft references to the set values
119) An implementation of the java util Map interface which can only hold a single object
120) An implementation of the java util Stack based on an ArrayList instead of a Vector, so it is not synchronized t
121) An integer hashmap
122) An object that maps keys to values, and values back to keys
123) An ObjectToSet provides a java util Map from arbitrary objects to objects of class java util Set
124) An unbounded {@link TransferQueue} based on linked nodes
125) An unbounded TransferQueue based on linked nodes
126) Anagrams
127) Animation for quick sort
128) Another Bitset demo
129) Another Link list
130) Another Set demo
131) Append all elements of other Collection to Java ArrayList
132) Append all elements of other Collection to Java Vector
133) Append item to array
134) Append one array to another
135) Append the given Object to the given array
136) Append, filter and get the size of collections
137) Appends an integer to an integer array
138) Appends an Object to an Object array
139) Array 2D
140) Array Converter
141) Array Copy Demo
142) Array Copy Utilities
143) Array Expander
144) Array Fill Test
145) Array helper
146) Array Hunt game
147) Array Initializers
148) Array Int Set
149) Array Iterator
150) Array initialization
151) Array map
152) Array Map extends AbstractMap
153) Array Of Arrays Demo 2
154) Array Search Test
155) Array Set
156) Array Set extends AbstractSet
157) Array Util
158) ArrayEnumeration class (implements Enumeration)
159) ArrayList of boolean primitives
160) ArrayList of byte primitives
161) ArrayList of char primitives
162) ArrayList of double primitives
163) ArrayList of float primitives
164) ArrayList of int primitives
165) ArrayList of long primitives
166) ArrayList of short primitives
167) ArrayList with sorted contents
168) ArrayListDemo done over using an ArrayList
169) Arrays of primitives
170) ArrayUtils provides static methods for manipulating arrays when using a tool such as java util ArrayList is inc
171) Associates keys with values
172) Associating a Value with an Object
173) Auto Size Array
174) Automatically Removing an Unreferenced Element from a Hash Table
175) Bidirectional Traversal with ListIterator
176) Binary Heap Queue
177) Binary Search
178) Binary search routines
179) Binary Tree
180) BinaryMap class implements a map from objects to integer objects where the only value is the integer with value
181) BitOHoney
182) BitOps
183) Blocking Queue
184) Bracket Checker
185) Bubble sort
186) Bucketized Hashtable
187) Build your own Linked List class
188) Building the anonymous inner class in-place
189) Byte array to int array
190) Byte Range
191) Cache based on SoftReference
192) Cache Map
193) Caching Hashtable
194) Calculate the minimum and maximum values out of a list of doubles
195) Call it an unordered list or a multiset, this collection is defined by oxymorons
196) Can you change the length of an array
197) Case Insensitive Map
198) CaseBlindHashMap - a HashMap extension, using Strings as key values
199) Char Prefix Tree
200) Character Stack
201) Check if a particular element exists in Java HashSet
202) Check if a particular element exists in Java LinkedHashSet
203) Check if a particular element exists in LinkedList Java example
204) Check if a particular key exists in Java HashMap example
205) Check if a particular key exists in Java Hashtable
206) Check if a particular key exists in Java LinkedHashMap example
207) Check if a particular key exists in Java TreeMap
208) Check if a particular value exists in Java HashMap example
209) Check if a particular value exists in Java Hashtable
210) Check if a particular value exists in Java LinkedHashMap example
211) Check if a particular value exists in Java TreeMap
212) Check if a particular value exists in Java TreeSet example
213) Check if a text is present at the current position in a buffer for byte array
214) Check if a text is present at the current position in a buffer(char array and char array)
215) Check if a text is present at the current position in a buffer(char array and string)
216) Check if object 1 contains object 2
217) Check whether the given Collection contains the given element instance
218) Checking what item is first in line without removing it
219) Checks whether two arrays are the same length, treating null arrays as length 0
220) Checks whether two arrays are the same type taking into account multi-dimensional arrays
221) Circular Queue
222) Circular Queue extends AbstractList
223) Class for storing start and end integer offsets
224) Class which creates mapping between keys and a list of values
225) Class which keeps a set of values and assigns each value a unique positive index
226) Clone an array
227) Clone Array
228) Clone two dimensional array
229) Clones a map
230) Clones a map and prefixes the keys in the clone
231) Clones the lhs map and add all things from the rhs map
232) Coarse-grained hash set
233) Collections
234) Collections fill
235) Collections min with Comparator
236) Collections reverse
237) Collections shuffle to shuffle a list
238) Combine Quick Sort Insertion Sort
239) Combines multiple values to form a single composite key MultiKey can often be used as an alternative to nested
240) Compact HashMap
241) Compact HashSet
242) Company and Employee
243) Comparable with a sorted collection
244) Comparator for comparing strings ignoring first character
245) Comparator similar to String CASE_INSENSITIVE_ORDER, but handles only ASCII characters
246) Comparator uses a Collator to determine the proper, case-insensitive lexicographical ordering of two strings.tx
247) Compare equality of two two-dimensional boolean array
248) Compare if two array is equal
249) Compare two boolean arrays and null
250) Compare two byte type arrays
251) Compare two char type arrays
252) Compare two double type arrays
253) Compare two float type arrays
254) Compare two int type arrays
255) Compare two long type arrays
256) Compare two short type arrays
257) Compares the initial elements of two arrays
258) Comparing Arrays
259) Complex Key HashMap
260) Compute prime numbers
261) Compute the area of a triangle using Herons Formula
262) Concatenate arrays
263) Concatenate Java arrays
264) Concatenates all the passed arrays
265) Concatenates the content of two enumerations into one
266) Concatenates the given int[] array into one String, inserting a delimiter between each pair of elements
267) Concatenates the given long[] array into one String, inserting a delimiter between each pair of elements
268) Concurrent Doubly LinkedList
269) Concurrent hash set that allows the lock array to be resized
270) Concurrent HashSet
271) Concurrent Hopscotch HashMap
272) Concurrent Skip List Map
273) Convert a LinkedList to ArrayList
274) Convert a List (ArrayList) to an Array with full length array
275) Convert a List (ArrayList) to an Array with zero length array
276) Convert a List to a Set
277) Convert a Queue to a List
278) Convert an Array to a List
279) Convert an array to a Map
280) Convert an Array to a Vector
281) Convert an ArrayList into an array
282) Convert an ArrayList to HashSet
283) Convert array of object to array of primitive
284) Convert array of primitives into array of objects
285) Convert Array to Collection
286) Convert array to list and sort
287) Convert array to Set
288) Convert array to string
289) Convert array to string (from c3p0)
290) Convert bitset to int array and string
291) Convert byte array to Integer and Long
292) Convert byte array to string
293) Convert collection into array
294) Convert Collection to ArrayList
295) Convert Iterable to List
296) Convert LinkedList to array
297) Convert LinkedList to Array with full length array
298) Convert LinkedList to Array with zero length array
299) Convert Properties into Map
300) Convert Set into array
301) Convert Set into List
302) Converting a Collection of String to an Array
303) Converting a Collection of user objects to an Array
304) Converting an Array to a Collection
305) Converts a Array to an Enumeration and allows it to be serialized
306) Converts a char array to a Set
307) Converts a string to a Set
308) Converts an array of Strings to a comma-sperated-list
309) Converts array into a java util Map
310) Converts infix arithmetic expressions to postfix
311) Copies bytes from the source byte array to the destination array
312) Copies the given array and adds the given element at the end of the new array (boolean value type)
313) Copies the given array and adds the given element at the end of the new array (byte value type)
314) Copies the given array and adds the given element at the end of the new array (char type value)
315) Copies the given array and adds the given element at the end of the new array (double type value)
316) Copies the given array and adds the given element at the end of the new array (float type value)
317) Copies the given array and adds the given element at the end of the new array (int value type)
318) Copies the given array and adds the given element at the end of the new array (long value type)
319) Copies the given array and adds the given element at the end of the new array (object value type)
320) Copies the given array and adds the given element at the end of the new array (short type array)
321) Copy all elements of Java ArrayList to an Object Array
322) Copy all elements of Java HashSet to an Object Array
323) Copy all elements of Java LinkedHashSet to an Object Array
324) Copy all elements of Java TreeSet to an Object Array Example
325) Copy all elements of Java Vector to an Object Array
326) Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2
327) Copy an array
328) Copy Elements of ArrayList to Java Vector
329) Copy Elements of One Java ArrayList to Another Java ArrayList
330) Copy Elements of One Java Vector to Another Java Vector
331) Copy Elements of Vector to Java ArrayList
332) Copy On Write ArrayList
333) Copy On Write Map
334) Copy some items of an array into another array
335) Copying Elements from One Array to Another
336) Count distinct elements in a Vector
337) Create a list with an ordered list of strings
338) Create a queue using LinkedList class
339) Create a repeated sequence of character
340) Create a Stack and Queue using ArrayDeque
341) Create a WeakHashMap with a single element in it
342) Create an array containing the elements in a set
343) Create an array containing the keys in a map
344) Create an array containing the values in a map
345) Create an empty collection object
346) Create an object array from elements of LinkedList Java example
347) Create and demonstrate an immutable collection
348) Create Java ArrayList From Enumeration
349) Create Java Hashtable from HashMap
350) Create List containing n Copies of Specified Object Example
351) Create multidimension arrays
352) Create singleton Iterator
353) Create type specific collections
354) Create Vector test
355) Creates a new subarray from a larger array
356) Creating a Comparable object
357) Creating a Copy of a Collection
358) Creating a Hash Table
359) Creating a Map That Retains Order-of-Insertion
360) Creating a Set That Retains Order-of-Insertion
361) Creating a Sorted Set
362) Creating a Two-Dimensional Array
363) Creating a Type-Specific Map
364) Creating a Type-Specific Map [5 0]
365) Creating an array of nonprimitive objects
366) Creating and storing arrays in a map
367) Creating arrays with new
368) Custom ArrayMap implementation (extends AbstractMap)
369) Custom ArraySet implementation (extends AbstractSet)
370) Custom hash table based on customized array
371) Cyclic Iteration
372) Data structure that mantains data in a ordered binary tree; each node is greater (smaller) or equal than its 2
373) Deep clone collection
374) Define array for class
375) Demonstrate iterators
376) Demonstrate the HashMap class, and an Iterator
377) Demonstrate the Hashtable class, and an Enumeration
378) Demonstrate the Set interface
379) Demonstrate use of Arrays sort on Booleans
380) Demonstrates heaps
381) Demonstrates the use of final collections
382) Demonstrating repeatable shuffling
383) Demonstrating the WeakHashMap
384) Demonstration of Stack Class
385) De-mystify the Iterator interface, showing how to write a simple Iterator for an Array of Objects
386) Determines if the given lists contain the same elements We suppose that all the elements of the given lists are
387) Disjoint two collections
388) Does the source array equal the match array
389) Does this byte array begin with match array content
390) Double LinkedList
391) Double List
392) Doubles the size of an array
393) Doubling the size of an array
394) Doubly Linked list
395) Doubly-linked list with data structure
396) Dump array content
397) Dump collection to String
398) Dump multi-dimensional arrays
399) Duplicate elements are discarded
400) Dynamic Int Array
401) Dynamic Long Array
402) Empty Enumeration
403) Empty Iterator
404) EmptyIterator is an iterator which is empty
405) Enumerate through a Vector using Java Enumeration
406) Enumeration interface which enumerates the items of an array
407) Exclude 2 arrays of ints
408) Expanding an Array
409) Expiring Map
410) Extend AbstractSet to Create Simple Set
411) Extend the size of an array
412) Extended Version of java util HashMap that provides an extended get method accpeting a default value
413) Extends ArrayListT to create Stack
414) Extensible vector of bytes
415) Fast Array
416) Fast Merge Sort
417) Fast Quick Sort
418) Fast stack
419) FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator
420) Fibonacci
421) Fibonacci heap data structure
422) File Name Comparator
423) Fill to a contiguous range of elements in an array
424) Filling Elements in an Array
425) Filling object arrays
426) Filtering Enumeration
427) Filters some elements out from the input enumeration
428) Find a value of the given type in the given Collection
429) Find connections using a depth-first search
430) Find connections using hill climbing
431) Find items in an array
432) Find maximum element of Java ArrayList
433) Find maximum element of Java HashSet
434) Find maximum element of Java Vector
435) Find Minimum element of Java ArrayList
436) Find Minimum element of Java HashSet
437) Find Minimum element of Java Vector
438) Find optimal solution using least-cost
439) Find the index of the array nearest to the value
440) Find the index of the value nearest to the key
441) Find the lost keys
442) Find Vector
443) Finding an Element in a Sorted Array
444) Finding an Element in a Sorted List
445) Finding elements in a vector
446) Finds the index of the given object in the array
447) Finds the index of the given object in the array starting at the given index
448) Finds the last index of the given object in the array starting at the given index
449) Finds the last index of the given object within the array
450) Finds the value in the range (start,limit) of the largest element (rank) where the count of all smaller element
451) Fixed Size Sorted Set
452) For both the keys and values of a map
453) For each element of the input enumeration asks the Processor to provide a replacement
454) For keys of a map
455) For values of a map
456) Format a Map
457) Frist last list
458) Generic collection conversion
459) Generic hashmap with String as key and Integer as value
460) Generic stack demo with annotation
461) Generic to list
462) Generic Vector with String
463) Get a key from value with an HashMap
464) Get array upperbound
465) Get Collection of Values from Java Hashtable
466) Get element in an ArrayList by index
467) Get elements from LinkedList Java example
468) Get Enumeration over Java ArrayList
469) Get Enumeration over Java HashSet
470) Get Enumeration over Java Vector
471) Get first and last elements from LinkedList Java example
472) Get generic Iterator from generic ArrayList
473) Get Head Map from Java TreeMap
474) Get Head Set from Java TreeSet example
475) Get index of long type array
476) Get key set and value set from map and use Iterator to loop through them
477) Get lowest and highest key stored in Java TreeMap
478) Get lowest and highest value stored in Java TreeSet
479) Get Previous and next index using Java ListIterator
480) Get Set view of Keys from Java HashMap example
481) Get Set view of Keys from Java Hashtable
482) Get Set view of Keys from Java LinkedHashMap
483) Get Set view of Keys from Java TreeMap
484) Get Size of Java ArrayList and loop through elements
485) Get Size of Java HashMap
486) Get Size of Java HashSet
487) Get Size of Java Hashtable
488) Get Size of Java LinkedHashMap
489) Get Size of Java LinkedHashSet
490) Get Size of Java TreeMap
491) Get Size of Java TreeSet
492) Get Size of Java Vector and loop through the elements
493) Get Sub List of Java ArrayList
494) Get Sub List of Java Vector Example
495) Get Sub Map from Java TreeMap
496) Get Sub Set from Java TreeSet
497) Get SubList from LinkedList Java example
498) Get Synchronized List from Java ArrayList
499) Get Synchronized Map from Java HashMap example
500) Get Synchronized Map from Java TreeMap
501) Get Synchronized Set from Java HashSet
502) Get Synchronized Set from Java TreeSet example
503) Get Tail Map from Java TreeMap
504) Get Tail Set from Java TreeSet
505) Get the difference of two collections
506) Get the element index and last index in a float type value array
507) Get the element index or last index among a boolean type array
508) Get the index and last index of a char type value array
509) Get the index and last index of a double type array
510) Get the index and last index of a short type value array
511) Get the index and last index of an int type value array
512) Get the index and last index of byte type array
513) Get the index of an array element
514) Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2
515) Get the maximum value in a double array
516) Get the size of an arraylist after and before add and remove methods
517) Gets the subarray from array that starts at offset
518) Gets the subarray of length length from array that starts at offset
519) Grow array
520) Growable array of floats
521) Growable array of ints
522) Growable int stack with type specific access methods
523) Growable int[]
524) Growable Object stack with type specific access methods
525) Growable String array with type specific access methods
526) Growable String stack with type specific access methods
527) Handles QuickSort and all of its methods
528) Hanoi puzzle
529) Hash map for counting references to Object keys
530) Hash map using String values as keys mapped to primitive int values
531) Hash table with double hashing
532) Hash table with linear probing
533) Hash table with separate chaining
534) HashMapString, Double
535) HashNMap stores multiple values by a single key value Values can be retrieved using a direct query or by creati
536) HashSet implementation of set
537) Hashtable that supports mostly-concurrent reading, but exclusive writing
538) Heap sort
539) Helper method for creating list
540) History management
541) History Map
542) Convert an ArrayList into an array
543) extend the collections framework
544) sort an array
545) If a List contains an item
546) If an ArrayList contains a given item
547) If array contains given element
548) If the element is a primitive type
549) Illustrates how to use some of the methods of the Arrays class
550) Implementation of a bit map of any size, together with static methods to manipulate int, byte and byte[] values
551) Implementation of disjoint-set data structure
552) Implementation of PaginatedList backed by an ArrayList
553) Implementing a Least-Recently-Used (LRU) Cache
554) Implementing a Queue with LinkedList
555) Implementing a Stack
556) Implements a Bloom filter Which, as you may not know, is a space-efficient structure for storing a set
557) Implements a combination of WeakHashMap and IdentityHashMap
558) Implements a HashSet where the objects given are stored in weak references
559) Implements a rolling list
560) Implements an java util Iterator over any array
561) Implements QuickSort three different ways
562) Implements the LZF lossless data compression algorithm
563) Implements the Set interface, backed by a ConcurrentHashMap instance
564) Indexed Set
565) Initialization and re-assignment of arrays
566) Initialize a static array
567) Initialize multidimensional array
568) Initializing a Two Dimensional Array
569) Initializing Array Values
570) Insert all elements of other Collection to Specified Index of Java ArrayList
571) Insert all elements of other Collection to Specified Index of Java Vector
572) Insert sort
573) Insert Sort for objects
574) Insert value to array
575) Inserting an Element into a Sorted Array
576) Inserts an Object into an Object array at the index position
577) Inserts the specified element at the specified position in the array
578) Inserts the specified element at the specified position in the boolean-type-value array
579) Inserts the specified element at the specified position in the byte-type-value array
580) Inserts the specified element at the specified position in the char-type-value array
581) Inserts the specified element at the specified position in the double-type-value array
582) Inserts the specified element at the specified position in the float-value-type array
583) Inserts the specified element at the specified position in the int-type-value array
584) Inserts the specified element at the specified position in the long-type-value array
585) Inserts the specified element at the specified position in the short-value-type array
586) Int Array
587) Int Array List
588) Int array to byte array
589) Int HashMap
590) Int HashMap from jodd org
591) Int Int Map
592) Int list
593) Int Object HashMap
594) Int Object HashMap (from CERN)
595) Int Object Map
596) Int Set
597) Int Vector
598) Int Vector (from java-objects-database)
599) Integer Map
600) Integer Sequence Generator
601) Integer value set
602) IntMap provides a simple hashmap from keys to integers
603) IntRange represents an inclusive range of ints
604) Invertible Comparator
605) Is collection is empty, and all of its elements are empty
606) Iterate a Collection and remove an item (Exception, wrong version)
607) Iterate over Set
608) Iterate through a Collection using Java Iterator
609) Iterate through elements Java ArrayList using Iterator
610) Iterate through elements Java ArrayList using ListIterator
611) Iterate through elements Java Vector using Iterator
612) Iterate through elements Java Vector using ListIterator
613) Iterate through elements of Java HashSet
614) Iterate through elements of Java LinkedHashSet
615) Iterate through elements of Java LinkedList using Iterator example
616) Iterate through elements of Java LinkedList using ListIterator example
617) Iterate through elements of Java TreeSet
618) Iterate through keys of Java Hashtable
619) Iterate through the values of Java HashMap example
620) Iterate through the values of Java LinkedHashMap
621) Iterate through the values of Java TreeMap
622) Iterate through values of Java Hashtable
623) Iterator class for sparse values in an array
624) Iterator class for values contained in an array range
625) Iterator Collection
626) Iterator out of Vector
627) Iterator Union of Iterators
628) Iterator Utils
629) Java 1 5 (5 0) Changes to the API
630) Java program to demonstrate multidimensional arrays
631) Java Sort byte Array
632) Java Sort char Array
633) Java Sort double Array
634) Java Sort float Array
635) Java utils Arrays provides ways to dump the content of an array
636) Keep upper and lowercase letters together
637) Lazy List creation based on ArrayList
638) Lazy Loading Reference
639) Lightweight tree n-arity structure
640) Linear Interpolation
641) Linear search
642) Link stack
643) Linked Iterator
644) Linked List example
645) List and Comparators
646) List containing other lists
647) List Iterator
648) List implementation with lazy array construction and modification tracking
649) List Map
650) List ordered map
651) List Reverse Test
652) List Search Test
653) List Set implements Set
654) List that allows items to be added with a priority that will affect the order in which they are later iterated
655) List to array
656) List with first and last references
657) Listing the Elements of a Collection
658) Listing the Elements of a Collection(iterate over the elements of set or list)
659) ListOfFiles implements EnumerationFileInputStream
660) ListSet extends List and Set
661) Long Range
662) Long Vector
663) LongRange represents an inclusive range of longs
664) Lookup table that stores a list of strings
665) Loop and remove element from a TreeSet
666) Looping through a Collection object
667) Lru Hashtable
668) LRU Map
669) LU Decomposition
670) Making a Collection Read-Only
671) Making a stack from a LinkedList
672) Manipulating the BitSet
673) Map from a given key to a list of values
674) Map from a given key to a set of values
675) Map implementation Optimized for Strings keys
676) Map List
677) Map techniques
678) Map to string
679) Map using Locale objects as keys
680) Map which stores items using SoftReference
681) Map with keys iterated in insertion order
682) Merge (or add) two arrays into one
683) Merge sort
684) Minimum and maximum number in array
685) Minimum heap implementation
686) Most Recently Used Map
687) Multi Dimension Array
688) Multi Map
689) Multi Value Map Array List
690) Multi Value Map Linked HashSet
691) MultiMap extends AbstractMap
692) MultiMap is a Java version of the C++ STL class std
693) Multiply two matrices
694) Natural Order Comparator
695) NumberRange represents an inclusive range of java lang Number objects of the same type
696) Object Int Map
697) Object Stack
698) One Item Set
699) Operations on bit-mapped fields
700) Operations on series of numbers
701) Order Retaining Map
702) Ordered Map
703) Pack chunks
704) Paging over a collection
705) Palidrome Array
706) Parse postfix arithmetic expressions
707) Pass the actual object you want removed
708) Perform Binary Search on Java ArrayList
709) Perform Binary Search on Java Vector
710) Performing Binary Search on Java byte Array Example
711) Performing Binary Search on Java char Array Example
712) Performing Binary Search on Java double Array Example
713) Performing Binary Search on Java float Array Example
714) Performing Binary Search on Java int Array Example
715) Performing Binary Search on Java long Array Example
716) Performing Binary Search on Java short Array
717) Permutator test
718) Pop an empty stack ntry times and catch the resulting exception
719) Prefetch Iterator
720) Pre-generics example that uses a collection
721) Prepends an Object to an Object array
722) Print a table of fahrenheit and celsius temperatures 1
723) Print a table of fahrenheit and celsius temperatures 2
724) Print a table of Fahrenheit and Celsius temperatures 3
725) Produces a new array containing the elements between the start and end indices
726) Produces a new boolean array containing the elements between the start and end indices
727) Produces a new byte array containing the elements between the start and end indices
728) Produces a new char array containing the elements between the start and end indices
729) Produces a new double array containing the elements between the start and end indices
730) Produces a new float array containing the elements between the start and end indices
731) Produces a new int array containing the elements between the start and end indices
732) Produces a new long array containing the elements between the start and end indices
733) Produces a new short array containing the elements between the start and end indices
734) Protects an given iterator by preventing calls to remove()
735) Puts the entire source array in the target array at offset offset
736) Putting your own type in a Set
737) Queue data structure
738) Quick Sort Implementation with median-of-three partitioning and cutoff for small arrays
739) Quick sort with median-of-three partitioning
740) Quicksort implementation for sorting arrays
741) Random-access dictionary
742) Read file content and save to a TreeMap
743) Recursive Binary Search Implementation in Java
744) Redundancy Checker
745) Reinitializes a byte array
746) Reinitializes an int array
747) Remove all elements from a set
748) Remove all elements from Java ArrayList
749) Remove all elements from Java HashSet
750) Remove all elements from Java LinkedHashSet
751) Remove all elements from Java TreeSet
752) Remove all elements from Java Vector
753) Remove all elements or clear LinkedList Java example
754) Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and se
755) Remove all values from Java HashMap example
756) Remove all values from Java Hashtable
757) Remove all values from Java LinkedHashMap
758) Remove all values from Java TreeMap
759) Remove an element from ArrayList using Java ListIterator
760) Remove an element from Collection using Java Iterator
761) Remove an element from specified index of Java ArrayList
762) Remove an element from specified index of Java Vector
763) Remove duplicate element from array
764) Remove duplicate items from an ArrayList
765) Remove element from HashSet
766) Remove Element in Vector
767) Remove first and last elements of LinkedList Java example
768) Remove one set from another set
769) Remove range of elements from LinkedList Java example
770) Remove specified element from Java HashSet
771) Remove specified element from Java LinkedHashSet
772) Remove specified element from Java TreeSet
773) Remove specified element from Java Vector
774) Remove specified element from LinkedList Java example
775) Remove value from Java HashMap
776) Remove value from Java Hashtable
777) Remove value from Java LinkedHashMap
778) Remove value from Java TreeMap
779) Removes all nulls from the input enumeration
780) Removes an element from a an array yielding a new array with that data
781) Removes an Object from an Object array
782) Removes duplicate elements from the array
783) Removes the element at the specified position from the specified array
784) Removes the element at the specified position from the specified long type array
785) Removes the first occurrence of the specified element from the specified array
786) Removes the first occurrence of the specified element from the specified long value array
787) Removing the first item from the queue
788) Replace All Elements Of Java ArrayList
789) Replace All Elements Of Java Vector
790) Replace all occurrences of specified element of Java ArrayList
791) Replace all occurrences of specified element of Java Vector
792) Replace an element at specified index of Java ArrayList
793) Replace an element at specified index of Java Vector
794) Replace an element from ArrayList using Java ListIterator
795) Replace an Element of LinkedList Java example
796) Represents a range of Number objects
797) Represents a sequence of integer values, either ascending or descending
798) Resizable-array implementation of the Deque interface
799) Resize an array, System arraycopy()
800) Retrieve environment variables (JDK1 5)
801) Retrive the quartile value from an array
802) Return a new byte array containing a sub-portion of the source array
803) Return a string representation of the given native two-dimensional long array
804) Return a String representation of the given two-dimensional object array
805) Return the first element in candidates that is contained in source
806) Return true if any element in candidates is contained in source
807) Return true if the array contains the element
808) Returns a copy of the specified array of objects of the specified size
809) Returns a new array containing all of a, with additional extra space added (zero initialized)
810) Returns an array of indices indicating the order the data should be sorted in
811) Returns the index in the source array where the first occurrence of the specified byte pattern is found
812) Returns the index in the source array where the first occurrence of the specified text (a String, converted to
813) Returns the index in the source array where the last occurrence of the specified byte pattern is found
814) Returns the index in the source array where the last occurrence of the specified text (a String, converted to a
815) Returns the maximum value in a byte-type array
816) Returns the maximum value in a double-type array
817) Returns the maximum value in a float-type array
818) Returns the maximum value in a long-value array
819) Returns the maximum value in a short-type array
820) Returns the maximum value in an int-type array
821) Returns the minimum value in a double-type array
822) Returns the minimum value in a float-value array
823) Returns the minimum value in a short-type array
824) Returns the minimum value in an array
825) Returns the minimum value in an int-type array
826) Returns the minimum value in an short-type array
827) Returns the number of times a value occurs in a given array
828) Returns the parent of the specified URI
829) Returns true if all the references in array1 are equal to all the references in array2 (two null references are
830) Returns true if any two items in the array are equal to one another Any null values in the array are ignored.tx
831) Reverse an Array
832) Reverse array elements order
833) Reverse Order Comparator
834) Reverse order of all elements of Java ArrayList
835) Reverse order of all elements of Java Vector
836) Reverse Polish Notation
837) Reverses the contents of the array
838) Reverses the order of the given boolean type value array
839) Reverses the order of the given byte type array
840) Reverses the order of the given char type value array
841) Reverses the order of the given double value type array
842) Reverses the order of the given float type value array
843) Reverses the order of the given int type value array
844) Reverses the order of the given long type value array
845) Reverses the order of the given object array
846) Reverses the order of the given short type value array
847) Rotate elements of a collection
848) Rotating queue of fixed size
849) Save Vector to file
850) Scan the content of a hashtable
851) Search an element of Java ArrayList
852) Search an element of Java Vector
853) Search an element of Java Vector from specific index
854) Search collection element
855) Search elements of LinkedList Java example
856) Search for a non-existent element
857) Search for a specified value of an array
858) Search for an object in an array
859) Search Tree
860) Search with a Comparator
861) Searches the specified array of doubles for the specified value using the binary search algorithm
862) Selection sort
863) Sequence
864) Sequenced HashMap
865) Serializing a vector
866) Set and TreeSet
867) Set Copy
868) Set implementation that use == instead of equals()
869) Set of utilities used to manipulate arrays
870) Set Operating on Lists
871) Set operations
872) Set size of Java Vector Example
873) Set subtraction
874) Set that compares object by identity rather than equality
875) Set union and intersection
876) Set which counts the number of times a values are added to it
877) Set which counts the number of times a values are added to it and assigns them a unique positive index
878) Set which holds its members by using of WeakReferences
879) Set with values iterated in insertion order
880) Set, HashSet and TreeSet
881) Shell sort
882) Shifting Elements in an Array
883) Show String Reversals
884) Show the union and intersection of two sets
885) Show Two-Dimensional Array of Objects
886) Shows the modern, generic form of collection classes
887) Shuffle a list
888) Shuffle elements of an array
889) Shuffle elements of Java ArrayList
890) Shuffle elements of Java Vector
891) Shuffle generic list
892) Shuffle the elements in the array
893) Shuffling the Elements of a List or Array
894) Sieve
895) Simple demonstration of HashMap
896) Simple demonstrations of the Collections utilities
897) Simple implementation of a generic Bag
898) Simple Java LinkedHashMap
899) Simple Java LinkedHashSet
900) Simple linked list class which uses a Comparator to sort the nodes
901) Simple object pool
902) Simple Queue (FIFO) based on LinkedList
903) Simple Sort Demo
904) Simple version of quick sort
905) Single Item Enumeration
906) Single linked list
907) Slice a list
908) Small sets whose elements are known to be unique by construction
909) Soft HashMap
910) Soft Valued HashMap
911) Soft ValueMap
912) Sometimes methods defined in the Collection interfaces dont work
913) Sort a list
914) Sort a String array
915) Sort an array
916) Sort an array of objects
917) Sort an array of strings in reverse order
918) Sort an array of strings, ignore case difference
919) Sort an HashMap based on the keys
920) Sort and Search a LinkedList
921) Sort array utilities
922) Sort array values in descending order
923) Sort backwards
924) Sort based on the values
925) Sort elements of Java ArrayList
926) Sort elements of Java Vector
927) Sort in reverse order
928) Sort items in a Set
929) Sort items of an array
930) Sort items of an ArrayList
931) Sort Java ArrayList in descending order using comparator
932) Sort Java Vector in descending order using comparator
933) Sort keys in an Hashtable
934) Sort Numbers
935) Sort on many(more than one) fields
936) Sort string array with Collator
937) Sorted Iterator
938) Sorted list
939) Sorted Multi Set
940) Sorting an Array
941) Sorting an Array in Descending (Reverse) Order
942) Sorting an array of Strings
943) Sorting Elements in a TreeMap
944) Sorting, Searching, and Inserting into a sorted array
945) Sorts map by values in ascending order
946) Sorts parts of the given array with the quicksort algorithm using the given comparator
947) Soundex - the Soundex Algorithm, as described by Knuth
948) Splits the list
949) Stack data structure
950) Stack for boolean values
951) Stack in java util
952) Static methods from Arrays
953) Static utility methods, classes, and abstract classes for iteration
954) Store user-defined objects in arraylist
955) Storing Primitive Types in a Collection
956) String array and output to console
957) String Map
958) String Reverser Through Stack
959) String search and reflection helper methods
960) Sub Array
961) Sum all elements in the array
962) Sums an array of numbers log(x1) log(xn)
963) Support for breadth-first enumerating
964) Swap elements of Java ArrayList
965) Swap elements of Java Vector
966) Sync Test
967) Synchronized Queue
968) Tail
969) Ternary Search Tree
970) Testing PhantomReference
971) Testing SoftReference
972) Testing WeakReference
973) Tests two float arrays for equality
974) The collection related utilities
975) The Generic Queue Class
976) The representation of a finite state machine
977) The use of BitSet
978) Things you can do with Sets
979) This class implements the data structures necessary for an ArrayQueue
980) This class implements the heap interface using a java util List as the underlying data structure
981) This class is designed to provide a generic tree that allows duplicates
982) This class wraps a HashMap and provides methods by which key objects can be associated with counting values
983) This constructs an Iterator over each day in a date range defined by a focus date and range style
984) This extension of HashMap support duplicate keys
985) This implementation of LinkedList that is optimized for element removal
986) This Map stores its keys as strings in upper case, null and duplicate keys are not allowed
987) This program animates a sort algorithm
988) This program demonstrates a triangular array
989) This program demonstrates array manipulation
990) This program demonstrates operations on linked lists
991) This program demonstrates the ArrayList class
992) This program demonstrates the random shuffle and sort algorithms
993) This program demonstrates the use of a map with key type String and value type Employee
994) This program demonstrates the use of the Comparable interface
995) This program shows how to store tabular data in a 2D array
996) This program sorts a set of item by comparing their descriptions
997) This program uses a set to print all unique words in System in
998) Timing array loop performance
999) To enable automatically release of the value, the value must be wrapped in a WeakReference object
1000) To get the number of dimensions
1001) To insert an object into a specific position into the list, specify the index in the add method
1002) Topological sorting
1003) Traverse through ArrayList in forward direction using Java ListIterator
1004) Traverse through ArrayList in reverse direction using Java ListIterator
1005) Treat an Enumeration as an Iterable
1006) Treat an Iterator as an Iterable
1007) Treating an Array as an Enumeration
1008) Tree Heap
1009) Tree Node
1010) Tree Node for the for a general tree of Objects
1011) TreeMapString, Double
1012) TreeSet Demo
1013) TreeSet, SortedSet and HashSet
1014) Triangular array
1015) Triangular numbers
1016) Triangular numbers with stack replaces recursion
1017) Tuple generic structure
1018) Turn an array of ints into a printable string
1019) Two double value arrays are almost equal
1020) Type-safe Map, from char array to String value
1021) Unmodifiable Vector Adapter
1022) Updating LinkedList Items
1023) Use addFirst method to add value to the first position in a linked list
1024) Use an Iterator and remove the item with Iterator remove()
1025) Use an Iterator to cycle through a collection in the forward direction
1026) Use Arrays asList() to convert Array to List
1027) Use Arrays copyOf to copy array
1028) Use Collections shuffle to shuffle list
1029) Use Collections sort to sort custom class and user defined Comparator
1030) Use EnumMap to store enum type data
1031) Use EnumSet to store enum type data
1032) Use for each loop to go through elements in a linkedlist
1033) Use Generic TreeMap to store Integer as key and String as value
1034) Use Iterator to loop through the HashMap class
1035) Use Iterator to loop through the map key set
1036) Use java util Arrays deepToString() to dump the multi-dimensional arrays
1037) Use reverse(), rotate(), and shuffle()
1038) Use set
1039) Use set method to change the value in an array list
1040) Use the for-each for loop to cycle through a collection
1041) Use the Iterator returned from ArrayList to loop through an array list
1042) Use the new shorthand notation to iterate through an array
1043) Use treemap
1044) Use Vector in java util
1045) Useful for string set lookups and command completion stuff
1046) Uses anonymous inner classes
1047) Using a LinkedList in multi-thread
1048) Using the Collections synchronized methods
1049) Using the Comparable interface to compare and sort objects
1050) Using the Double Brace Initialization
1051) Using the length Variable
1052) Utilities for flop (floating-point operation) counting
1053) Utility class for generating the k-subsets of the numbers 0 to n
1054) Utility class that provides a lazy initialization object wrapper
1055) Utility method that return a String representation of a map The elements will be represented as key = value
1056) Utility method that return a String representation of a map The elements will be represented as key = value (ta
1057) Utility methods for operating on memory-efficient lists All lists of size 0 or 1 are assumed to be immutable.tx
1058) Utility methods for operating on memory-efficient maps
1059) Value Range generic structure
1060) Vector Util
1061) Version
1062) Weak HashSet
1063) Weak HashSet from objectweb jac
1064) Weak HashSet from TJDO
1065) Weak Identity Map
1066) Weak List from objectweb jac
1067) Weak Value HashMap
1068) Weak Valued HashMap
1069) Weak ValueMap
1070) WeakReference list uses java lang ref WeakReferences to store its contents
1071) What you can do with a TreeMap
1072) What you can do with a TreeSet
1073) When comparing Object arrays, null elements are equal If the elements are not null, Object equals() is used
1074) Whether Collection only contains a single unique object
1075) Working with HashSet and TreeSet
1076) Working with Key-Value Pairs in a Hashtable
1077) Wrap queue to synchronize the methods
1078) Wrapping an Iterator around an Enumeration
1079) Writing Your own Comparator
1080) Your own auto-growth Array
1081) Your own tree with generic user object